0.12/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.12/0.13 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.13/0.35 % Computer : n013.cluster.edu 0.13/0.35 % Model : x86_64 x86_64 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.35 % Memory : 8042.1875MB 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.35 % CPULimit : 1200 0.13/0.35 % WCLimit : 120 0.13/0.35 % DateTime : Tue Jul 13 10:44:18 EDT 2021 0.13/0.35 % CPUTime : 0.13/0.35 % Number of cores: 8 0.13/0.36 % Python version: Python 3.6.8 0.13/0.36 # Version: 2.6rc1-ho 0.13/0.36 # No SInE strategy applied 0.13/0.36 # Trying AutoSched0 for 59 seconds 0.13/0.39 # AutoSched0-Mode selected heuristic G_E___092_C01_F1_PI_AE_Q4_CS_SP_PS_S0Y 0.13/0.39 # and selection function SelectMaxLComplexAvoidPosPred. 0.13/0.39 # 0.13/0.39 # Preprocessing time : 0.029 s 0.13/0.39 # Presaturation interreduction done 0.13/0.39 0.13/0.39 # Proof found! 0.13/0.39 # SZS status Theorem 0.13/0.39 # SZS output start CNFRefutation 0.13/0.39 thf(cEXT_IMP_EMB2, conjecture, (![X1:$o > $o]:((X1 @ (a)&X1 @ (b))=>X1 @ ((a&b)))<=![X2:$o, X3:$o]:(![X4:$o > $o]:(X4 @ (X2)=>X4 @ (X3))<=(X2<=>X3))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', cEXT_IMP_EMB2)). 0.13/0.39 thf(c_0_1, negated_conjecture, ~((![X2:$o, X3:$o]:((X2<=>X3)=>![X4:$o > $o]:(((~X2|X4 @ $true)&(X2|X4 @ $false))=>((~X3|X4 @ $true)&(X3|X4 @ $false))))=>![X1:$o > $o]:((((~a|X1 @ $true)&(a|X1 @ $false))&((~b|X1 @ $true)&(b|X1 @ $false)))=>((~((a&b))|X1 @ $true)&((a&b)|X1 @ $false))))), inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(assume_negation,[status(cth)],[cEXT_IMP_EMB2])])])). 0.13/0.39 thf(c_0_2, negated_conjecture, ![X9:$o, X10:$o, X11:$o > $o]:((((((~X10|X11 @ $true|(~X9|X9)|(~X9|~X10))&(X10|X11 @ $false|(~X9|X9)|(~X9|~X10)))&((~X10|X11 @ $true|(~X11 @ $false|X9)|(~X9|~X10))&(X10|X11 @ $false|(~X11 @ $false|X9)|(~X9|~X10))))&(((~X10|X11 @ $true|(~X9|~X11 @ $true)|(~X9|~X10))&(X10|X11 @ $false|(~X9|~X11 @ $true)|(~X9|~X10)))&((~X10|X11 @ $true|(~X11 @ $false|~X11 @ $true)|(~X9|~X10))&(X10|X11 @ $false|(~X11 @ $false|~X11 @ $true)|(~X9|~X10)))))&((((~X10|X11 @ $true|(~X9|X9)|(X9|X10))&(X10|X11 @ $false|(~X9|X9)|(X9|X10)))&((~X10|X11 @ $true|(~X11 @ $false|X9)|(X9|X10))&(X10|X11 @ $false|(~X11 @ $false|X9)|(X9|X10))))&(((~X10|X11 @ $true|(~X9|~X11 @ $true)|(X9|X10))&(X10|X11 @ $false|(~X9|~X11 @ $true)|(X9|X10)))&((~X10|X11 @ $true|(~X11 @ $false|~X11 @ $true)|(X9|X10))&(X10|X11 @ $false|(~X11 @ $false|~X11 @ $true)|(X9|X10))))))&((((~a|epred1_0 @ $true)&(a|epred1_0 @ $false))&((~b|epred1_0 @ $true)&(b|epred1_0 @ $false)))&((((~a|~b|a)&(~epred1_0 @ $false|a))&((~a|~b|b)&(~epred1_0 @ $false|b)))&((~a|~b|~epred1_0 @ $true)&(~epred1_0 @ $false|~epred1_0 @ $true))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])). 0.13/0.39 thf(c_0_3, negated_conjecture, (b|~epred1_0 @ $false), inference(split_conjunct,[status(thm)],[c_0_2])). 0.13/0.39 thf(c_0_4, negated_conjecture, (b|epred1_0 @ $false), inference(split_conjunct,[status(thm)],[c_0_2])). 0.13/0.39 thf(c_0_5, negated_conjecture, (a|~epred1_0 @ $false), inference(split_conjunct,[status(thm)],[c_0_2])). 0.13/0.39 thf(c_0_6, negated_conjecture, (a|epred1_0 @ $false), inference(split_conjunct,[status(thm)],[c_0_2])). 0.13/0.39 thf(c_0_7, negated_conjecture, (~a|~b|~epred1_0 @ $true), inference(split_conjunct,[status(thm)],[c_0_2])). 0.13/0.39 thf(c_0_8, negated_conjecture, b, inference(csr,[status(thm)],[c_0_3, c_0_4])). 0.13/0.39 thf(c_0_9, negated_conjecture, a, inference(csr,[status(thm)],[c_0_5, c_0_6])). 0.13/0.39 thf(c_0_10, negated_conjecture, (epred1_0 @ $true|~b), inference(split_conjunct,[status(thm)],[c_0_2])). 0.13/0.39 thf(c_0_11, negated_conjecture, ~epred1_0 @ $true, inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7, c_0_8]), c_0_9])])). 0.13/0.39 thf(c_0_12, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10, c_0_8])]), c_0_11]), ['proof']). 0.13/0.39 # SZS output end CNFRefutation 0.13/0.39 # Proof object total steps : 13 0.13/0.39 # Proof object clause steps : 10 0.13/0.39 # Proof object formula steps : 3 0.13/0.39 # Proof object conjectures : 13 0.13/0.39 # Proof object clause conjectures : 10 0.13/0.39 # Proof object formula conjectures : 3 0.13/0.39 # Proof object initial clauses used : 6 0.13/0.39 # Proof object initial formulas used : 1 0.13/0.39 # Proof object generating inferences : 0 0.13/0.39 # Proof object simplifying inferences : 8 0.13/0.39 # Training examples: 0 positive, 0 negative 0.13/0.39 # Parsed axioms : 3 0.13/0.39 # Removed by relevancy pruning/SinE : 0 0.13/0.39 # Initial clauses : 28 0.13/0.39 # Removed in clause preprocessing : 20 0.13/0.39 # Initial clauses in saturation : 8 0.13/0.39 # Processed clauses : 9 0.13/0.39 # ...of these trivial : 0 0.13/0.39 # ...subsumed : 0 0.13/0.39 # ...remaining for further processing : 8 0.13/0.39 # Other redundant clauses eliminated : 0 0.13/0.39 # Clauses deleted for lack of memory : 0 0.13/0.39 # Backward-subsumed : 0 0.13/0.39 # Backward-rewritten : 4 0.13/0.39 # Generated clauses : 0 0.13/0.39 # ...of the previous two non-trivial : 2 0.13/0.39 # Contextual simplify-reflections : 2 0.13/0.39 # Paramodulations : 0 0.13/0.39 # Factorizations : 0 0.13/0.39 # NegExts : 0 0.13/0.39 # Equation resolutions : 0 0.13/0.39 # Propositional unsat checks : 0 0.13/0.39 # Propositional check models : 0 0.13/0.39 # Propositional check unsatisfiable : 0 0.13/0.39 # Propositional clauses : 0 0.13/0.39 # Propositional clauses after purity: 0 0.13/0.39 # Propositional unsat core size : 0 0.13/0.39 # Propositional preprocessing time : 0.000 0.13/0.39 # Propositional encoding time : 0.000 0.13/0.39 # Propositional solver time : 0.000 0.13/0.39 # Success case prop preproc time : 0.000 0.13/0.39 # Success case prop encoding time : 0.000 0.13/0.39 # Success case prop solver time : 0.000 0.13/0.39 # Current number of processed clauses : 4 0.13/0.39 # Positive orientable unit clauses : 2 0.13/0.39 # Positive unorientable unit clauses: 0 0.13/0.39 # Negative unit clauses : 1 0.13/0.39 # Non-unit-clauses : 1 0.13/0.39 # Current number of unprocessed clauses: 1 0.13/0.39 # ...number of literals in the above : 1 0.13/0.39 # Current number of archived formulas : 0 0.13/0.39 # Current number of archived clauses : 4 0.13/0.39 # Clause-clause subsumption calls (NU) : 2 0.13/0.39 # Rec. Clause-clause subsumption calls : 2 0.13/0.39 # Non-unit clause-clause subsumptions : 2 0.13/0.39 # Unit Clause-clause subsumption calls : 1 0.13/0.39 # Rewrite failures with RHS unbound : 0 0.13/0.39 # BW rewrite match attempts : 2 0.13/0.39 # BW rewrite match successes : 2 0.13/0.39 # Condensation attempts : 0 0.13/0.39 # Condensation successes : 0 0.13/0.39 # Termbank termtop insertions : 1164 0.13/0.39 0.13/0.39 # ------------------------------------------------- 0.13/0.39 # User time : 0.029 s 0.13/0.39 # System time : 0.003 s 0.13/0.39 # Total time : 0.032 s 0.13/0.39 # Maximum resident set size: 1632 pages 0.13/0.39 EOF